Weighted Polynomial Approximation in the Complex Plane
نویسندگان
چکیده
منابع مشابه
Weighted Polynomial Approximation in the Complex Plane
Given a pair (G,W ) of an open bounded set G in the complex plane and a weight function W (z) which is analytic and different from zero in G, we consider the problem of the locally uniform approximation of any function f(z), which is analytic in G, by weighted polynomials of the form {Wn(z)Pn(z)}n=0, where deg Pn ≤ n. The main result of this paper is a necessary and sufficient condition for suc...
متن کاملA Randomized Fully Polynomial-time Approximation Scheme for Weighted Perfect Matching in the Plane
In the approximate Euclidean min-weighted perfect matching problem, a set V of n 2 points in the plane and a real number 0 are given. Usually, a solution of this problem is a partition of points of V into n pairs such that the sum of the distances between the paired points is at most ) 1 ( times the optimal solution. In this paper, the authors give a randomized algorithm which follows a...
متن کاملWeighted Polynomial Approximation on the Integers
We prove here some polynomial approximation theorems, somewhat related to the Szasz-Mfintz theorem, but where the domain of approximation is the integers, by dualizing a gap theorem of C. l ~ Y I for periodic entire functions. In another Paper [7], we shall prove, by similar means, a completeness theorem ibr some special sets of entire functions. I t is well known (see, for example [l]) tha t i...
متن کاملIncomplete Rational Approximation in the Complex Plane
in certain natural regions in the complex plane where Pc, and q. are polynomials of degree cn and n, respectively. In particular we construct natural maximal regions (as a function of ~ and e) where the collection of such rational functions is dense in the analytical functions. So from this point of view we have rather complete analog theorems to the results concerning incomplete polynomials on...
متن کاملWeighted Rectilinear Approximation of Points in the Plane
We consider the problem of weighted rectilinear approximation on the plane and offer both exact algorithms and heuristics with provable performance bounds. Let S = {(pi, wi)} be a set of n points pi in the plane, with associated distance-modifying weights wi > 0. We present algorithms for finding the best fit to S among x-monotone rectilinear polylines R with a given number k < n of horizontal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constructive Approximation
سال: 1998
ISSN: 0176-4276,1432-0940
DOI: 10.1007/s003659900086